Random Assignment Problems on 2d Manifolds

نویسندگان

چکیده

We consider the assignment problem between two sets of $N$ random points on a smooth, two-dimensional manifold $\Omega$ unit area. It is known that average cost scales as $E_{\Omega}(N)\sim\frac{1}{2\pi}\ln N$ with correction at most order $\sqrt{\ln N\ln\ln N}$. In this paper, we show that, within linearization approximation field-theoretical formulation problem, first $\Omega$-dependent constant term, and can be exactly computed from spectrum Laplace--Beltrami operator $\Omega$. perform explicit calculation for various families surfaces, compare our predictions extensive numerics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random assignment problems

Analysis of random instances of optimization problems is instrumental for understanding of the behavior and properties of problem’s solutions, feasible region, optimal values, especially in large-scale cases. A class of problems that have been studied extensively in the literature using the methods of probabilistic analysis is represented by the assignment problems, and many important problems ...

متن کامل

Asymptotic Results for Random Multidimensional Assignment Problems

The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization problem occurring in applications such as data association and target tracking. In this paper, we investigate characteristics of the mean optimal solution values for random MAPs with axial constraints. Throughout the study, we consider cost coefficients taken from three different random distributions: uniform...

متن کامل

Random assignment and shortest path problems

The purpose of this article is to bring together some results on random assignment and shortest path problems, and to clarify how they relate to each other. In particular, we investigate the consequences of the two very different and hard proofs of the ζ(2) limit theorem for the random assignment problem given by David Aldous [1] and by Chandra Nair, Balaji Prabhakar and Mayank Sharma [11]. The...

متن کامل

On the Asymptotic Properties of Random Multidimensional Assignment Problems

The Multidimensional Assignment Problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in [1] and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when ...

متن کامل

Problems on homology manifolds

In these notes “homology manifold” means ENR (Euclidean neighborhood retract) Z–coefficient homology manifold, unless otherwise specified, and “exotic” means not a manifold factor (ie local or “Quinn” index 6= 1. We use the multiplicative version of the local index, taking values in 1+8Z). In the last decade exotic homology manifolds have been shown to exist and quite a bit of structure theory ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2021

ISSN: ['0022-4715', '1572-9613']

DOI: https://doi.org/10.1007/s10955-021-02768-4